The Frobenius Problem, Rational Polytopes, and Fourier-Dedekind Sums
نویسندگان
چکیده
where a1, . . . , an are positive integers. This polytope is closely related to the linear Diophantine problem of Frobenius: given relatively prime positive integers a1, . . . , an, find the largest value of t (the Frobenius number) such that m1a1 + · · · + mnan = t has no solution in positive integers m1, . . . , mn. This is equivalent to the problem of finding the largest dilate tP such that the facet
منابع مشابه
Dedekind sums : a combinatorial - geometric viewpoint Matthias Beck and Sinai Robins
The literature on Dedekind sums is vast. In this expository paper we show that there is a common thread to many generalizations of Dedekind sums, namely through the study of lattice point enumeration of rational poly-topes. In particular, there are some natural finite Fourier series which we call Fourier-Dedekind sums, and which form the building blocks of the number of partitions of an integer...
متن کاملA hybrid mean value involving a new Gauss sums and Dedekind sums
In this paper, we introduce a new sum analogous to Gauss sum, then we use the properties of the classical Gauss sums and analytic method to study the hybrid mean value problem involving this new sums and Dedekind sums, and give an interesting identity for it.
متن کاملTwisted Dedekind Type Sums Associated with Barnes’ Type Multiple Frobenius-Euler l-Functions
The aim of this paper is to construct new Dedekind type sums. We construct generating functions of Barnes’ type multiple FrobeniusEuler numbers and polynomials. By applying Mellin transformation to these functions, we define Barnes’ type multiple l-functions, which interpolate Frobenius-Euler numbers at negative integers. By using generalizations of the Frobenius-Euler functions, we define gene...
متن کاملExplicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind - Rademacher Sums
We give explicit, polynomial–time computable formulas for the number of integer points in any two– dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of our formulas are Dedekind–Rademacher sums, which are polynomial–time computable finite Fourier series. As a by–product we rederive a reciprocity law for these...
متن کاملN ov 2 00 1 Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind – Rademacher sums
We give explicit, polynomial–time computable formulas for the number of integer points in any two– dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of our formulas are Dedekind–Rademacher sums, which are polynomial–time computable finite Fourier series. As a by–product we rederive a reciprocity law for these...
متن کامل